Co-regularized multi-view sparse reconstruction embedding for dimension reduction
نویسندگان
چکیده
منابع مشابه
Co-regularized PLSA for Multi-view Clustering
Multi-view data is common in a wide variety of application domains. Properly exploiting the relations among different views is helpful to alleviate the difficulty of a learning problem of interest. To this end, we propose an extended Probabilistic Latent Semantic Analysis (PLSA) model for multi-view clustering, named Co-regularized PLSA (CoPLSA). CoPLSA integrates individual PLSAs in different ...
متن کاملCo-regularized Multi-view Spectral Clustering
In many clustering problems, we have access to multiple views of the data each of which could be individually used for clustering. Exploiting information from multiple views, one can hope to find a clustering that is more accurate than the ones obtained using the individual views. Often these different views admit same underlying clustering of the data, so we can approach this problem by lookin...
متن کاملRegularized singular value decomposition: a sparse dimension reduction technique
Singular value decomposition (SVD) is a useful multivariate technique for dimension reduction. It has been successfully applied to analyze microarray data, where the eigen vectors are called eigen-genes/arrays. One weakness associated with the SVD is the interpretation. The eigen-genes are essentially linear combinations of all the genes. It is desirable to have sparse SVD, which retains the di...
متن کاملNeighborhood Co-regularized Multi-view Spectral Clustering of Microbiome Data
In many unsupervised learning problems data can be available in different representations, often referred to as views. By leveraging information from multiple views we can obtain clustering that is more robust and accurate compared to the one obtained via the individual views. We propose a novel algorithm that is based on neighborhood co-regularization of the clustering hypotheses and that sear...
متن کاملSigned Laplacian Embedding for Supervised Dimension Reduction
Manifold learning is a powerful tool for solving nonlinear dimension reduction problems. By assuming that the high-dimensional data usually lie on a low-dimensional manifold, many algorithms have been proposed. However, most algorithms simply adopt the traditional graph Laplacian to encode the data locality, so the discriminative ability is limited and the embedding results are not always suita...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neurocomputing
سال: 2019
ISSN: 0925-2312
DOI: 10.1016/j.neucom.2019.03.080